Robust gates for holonomic quantum computation
نویسندگان
چکیده
Giuseppe Florio, 2 Paolo Facchi, 2 Rosario Fazio, 5 Vittorio Giovannetti, and Saverio Pascazio Dipartimento di Fisica, Università di Bari, I-70126 Bari, Italy INFN, Sezione di Bari, I-70126 Bari, Italy Dipartimento di Matematica, Università di Bari, I-70125 Bari, Italy NEST CNR-INFM & Scuola Normale Superiore, Piazza dei Cavalieri 7, 56126 Pisa, Italy International School for Advanced Studies (SISSA) via Beirut 2-4, I-34014 Trieste, ITALY (Dated: March 20, 2006)
منابع مشابه
Realization of arbitrary gates in holonomic quantum computation
Among the many proposals for the realization of a quantum computer, holonomic quantum computation is distinguished from the rest as it is geometrical in nature and thus expected to be robust against decoherence. Here we analyze the realization of various quantum gates by solving the inverse problem: Given a unitary matrix, we develop a formalism by which we find loops in the parameter space gen...
متن کاملNon-adiabatic holonomic quantum computation in linear system-bath coupling
Non-adiabatic holonomic quantum computation in decoherence-free subspaces protects quantum information from control imprecisions and decoherence. For the non-collective decoherence that each qubit has its own bath, we show the implementations of two non-commutable holonomic single-qubit gates and one holonomic nontrivial two-qubit gate that compose a universal set of non-adiabatic holonomic qua...
متن کاملFast non-Abelian geometric gates via transitionless quantum driving
A practical quantum computer must be capable of performing high fidelity quantum gates on a set of quantum bits (qubits). In the presence of noise, the realization of such gates poses daunting challenges. Geometric phases, which possess intrinsic noise-tolerant features, hold the promise for performing robust quantum computation. In particular, quantum holonomies, i.e., non-Abelian geometric ph...
متن کاملExact Solutions of Holonomic Quantum Computation
Holonomic quantum computation is analyzed from geometrical viewpoint. We develop an optimization scheme in which an arbitrary unitary gate is implemented with a small circle in a complex projective space. Exact solutions for the Hadamard, CNOT and 2-qubit discrete Fourier transformation gates are explicitly constructed.
متن کاملHolonomic quantum computation in subsystems.
We introduce a generalized method of holonomic quantum computation (HQC) based on encoding in subsystems. As an application, we propose a scheme for applying holonomic gates to unencoded qubits by the use of a noisy ancillary qubit. This scheme does not require initialization in a subspace since all dynamical effects factor out as a transformation on the ancilla. We use this approach to show ho...
متن کامل